<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>popot-2.01: /opt/GoogleCode/popot/trunk/popot-2.01/src/mersenne.h Source File</title>

<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css" />

<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>

</head>
<body>
<div id="top"><!-- do not remove this div! -->


<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  
  
  <td style="padding-left: 0.5em;">
   <div id="projectname">popot-2.01
   
   </div>
   
  </td>
  
  
  
 </tr>
 </tbody>
</table>
</div>

<!-- Generated by Doxygen 1.7.5 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li><a href="examples.html"><span>Examples</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>File&#160;Members</span></a></li>
    </ul>
  </div>
<div class="header">
  <div class="headertitle">
<div class="title">/opt/GoogleCode/popot/trunk/popot-2.01/src/mersenne.h</div>  </div>
</div>
<div class="contents">
<a href="mersenne_8h.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="preprocessor">#ifndef POPOT_RNG_GENERATORS_MERSENNE_H</span>
<a name="l00002"></a>00002 <span class="preprocessor"></span><span class="preprocessor">#define POPOT_RNG_GENERATORS_MERSENNE_H</span>
<a name="l00003"></a>00003 <span class="preprocessor"></span>
<a name="l00004"></a>00004 <span class="comment">/* </span>
<a name="l00005"></a>00005 <span class="comment">   A C-program for MT19937-64 (2004/9/29 version).</span>
<a name="l00006"></a>00006 <span class="comment">   Coded by Takuji Nishimura and Makoto Matsumoto.</span>
<a name="l00007"></a>00007 <span class="comment"></span>
<a name="l00008"></a>00008 <span class="comment">   This is a 64-bit version of Mersenne Twister pseudorandom number</span>
<a name="l00009"></a>00009 <span class="comment">   generator.</span>
<a name="l00010"></a>00010 <span class="comment"></span>
<a name="l00011"></a>00011 <span class="comment">   Before using, initialize the state by using init_genrand64(seed)  </span>
<a name="l00012"></a>00012 <span class="comment">   or init_by_array64(init_key, key_length).</span>
<a name="l00013"></a>00013 <span class="comment"></span>
<a name="l00014"></a>00014 <span class="comment">   Copyright (C) 2004, Makoto Matsumoto and Takuji Nishimura,</span>
<a name="l00015"></a>00015 <span class="comment">   All rights reserved.                          </span>
<a name="l00016"></a>00016 <span class="comment"></span>
<a name="l00017"></a>00017 <span class="comment">   Redistribution and use in source and binary forms, with or without</span>
<a name="l00018"></a>00018 <span class="comment">   modification, are permitted provided that the following conditions</span>
<a name="l00019"></a>00019 <span class="comment">   are met:</span>
<a name="l00020"></a>00020 <span class="comment"></span>
<a name="l00021"></a>00021 <span class="comment">   1. Redistributions of source code must retain the above copyright</span>
<a name="l00022"></a>00022 <span class="comment">   notice, this list of conditions and the following disclaimer.</span>
<a name="l00023"></a>00023 <span class="comment"></span>
<a name="l00024"></a>00024 <span class="comment">   2. Redistributions in binary form must reproduce the above copyright</span>
<a name="l00025"></a>00025 <span class="comment">   notice, this list of conditions and the following disclaimer in the</span>
<a name="l00026"></a>00026 <span class="comment">   documentation and/or other materials provided with the distribution.</span>
<a name="l00027"></a>00027 <span class="comment"></span>
<a name="l00028"></a>00028 <span class="comment">   3. The names of its contributors may not be used to endorse or promote </span>
<a name="l00029"></a>00029 <span class="comment">   products derived from this software without specific prior written </span>
<a name="l00030"></a>00030 <span class="comment">   permission.</span>
<a name="l00031"></a>00031 <span class="comment"></span>
<a name="l00032"></a>00032 <span class="comment">   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS</span>
<a name="l00033"></a>00033 <span class="comment">   &quot;AS IS&quot; AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT</span>
<a name="l00034"></a>00034 <span class="comment">   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR</span>
<a name="l00035"></a>00035 <span class="comment">   A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR</span>
<a name="l00036"></a>00036 <span class="comment">   CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,</span>
<a name="l00037"></a>00037 <span class="comment">   EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,</span>
<a name="l00038"></a>00038 <span class="comment">   PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR</span>
<a name="l00039"></a>00039 <span class="comment">   PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF</span>
<a name="l00040"></a>00040 <span class="comment">   LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING</span>
<a name="l00041"></a>00041 <span class="comment">   NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS</span>
<a name="l00042"></a>00042 <span class="comment">   SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.</span>
<a name="l00043"></a>00043 <span class="comment"></span>
<a name="l00044"></a>00044 <span class="comment">   References:</span>
<a name="l00045"></a>00045 <span class="comment">   T. Nishimura, ``Tables of 64-bit Mersenne Twisters&#39;&#39;</span>
<a name="l00046"></a>00046 <span class="comment">   ACM Transactions on Modeling and </span>
<a name="l00047"></a>00047 <span class="comment">   Computer Simulation 10. (2000) 348--357.</span>
<a name="l00048"></a>00048 <span class="comment">   M. Matsumoto and T. Nishimura,</span>
<a name="l00049"></a>00049 <span class="comment">   ``Mersenne Twister: a 623-dimensionally equidistributed</span>
<a name="l00050"></a>00050 <span class="comment">   uniform pseudorandom number generator&#39;&#39;</span>
<a name="l00051"></a>00051 <span class="comment">   ACM Transactions on Modeling and </span>
<a name="l00052"></a>00052 <span class="comment">   Computer Simulation 8. (Jan. 1998) 3--30.</span>
<a name="l00053"></a>00053 <span class="comment"></span>
<a name="l00054"></a>00054 <span class="comment">   Any feedback is very welcome.</span>
<a name="l00055"></a>00055 <span class="comment">   http://www.math.hiroshima-u.ac.jp/~m-mat/MT/emt.html</span>
<a name="l00056"></a>00056 <span class="comment">   email: m-mat @ math.sci.hiroshima-u.ac.jp (remove spaces)</span>
<a name="l00057"></a>00057 <span class="comment">*/</span>
<a name="l00058"></a>00058 
<a name="l00059"></a><a class="code" href="mersenne_8h.html#a170755e30c36be4904106b7bb279b1ec">00059</a> <span class="preprocessor">#define NN 312</span>
<a name="l00060"></a><a class="code" href="mersenne_8h.html#afdc383f8992f4a960bb22998f57b6d37">00060</a> <span class="preprocessor"></span><span class="preprocessor">#define MM 156</span>
<a name="l00061"></a><a class="code" href="mersenne_8h.html#a376c3581bae3c2367fc9ce694e5a8949">00061</a> <span class="preprocessor"></span><span class="preprocessor">#define MATRIX_A 0xB5026F5AA96619E9ULL</span>
<a name="l00062"></a><a class="code" href="mersenne_8h.html#a4b9cfb88c6beb4254e2971abacbd8aab">00062</a> <span class="preprocessor"></span><span class="preprocessor">#define UM 0xFFFFFFFF80000000ULL </span><span class="comment">/* Most significant 33 bits */</span>
<a name="l00063"></a><a class="code" href="mersenne_8h.html#a4b3e3200940ab78533ae2126430fe840">00063</a> <span class="preprocessor">#define LM 0x7FFFFFFFULL </span><span class="comment">/* Least significant 31 bits */</span>
<a name="l00064"></a>00064 
<a name="l00065"></a>00065 <span class="keyword">namespace </span>popot
<a name="l00066"></a>00066 {
<a name="l00067"></a><a class="code" href="namespacepopot_1_1rng.html">00067</a>   <span class="keyword">namespace </span>rng
<a name="l00068"></a>00068   {
<a name="l00069"></a>00069     <span class="keyword">class </span><a class="code" href="classpopot_1_1rng_1_1MersenneRNG.html">MersenneRNG</a>
<a name="l00070"></a>00070     {
<a name="l00071"></a>00071       <span class="keyword">static</span> <span class="keywordtype">int</span> mti;
<a name="l00072"></a>00072       <span class="keyword">static</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> <span class="keywordtype">long</span> mt[<a class="code" href="mersenne_8h.html#a170755e30c36be4904106b7bb279b1ec">NN</a>];
<a name="l00073"></a>00073 
<a name="l00074"></a>00074     <span class="keyword">public</span>:
<a name="l00075"></a>00075 
<a name="l00076"></a><a class="code" href="classpopot_1_1rng_1_1MersenneRNG.html#ac5285a6ef7c784ad6b3d4b288aaa5ff8">00076</a>       <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> <a class="code" href="classpopot_1_1rng_1_1MersenneRNG.html#ac5285a6ef7c784ad6b3d4b288aaa5ff8">RNG_RAND_MAX</a> = 1;
<a name="l00077"></a><a class="code" href="classpopot_1_1rng_1_1MersenneRNG.html#a686f65e78d16508866446199fda3212d">00077</a>       <span class="keyword">static</span> <span class="keywordtype">int</span> <a class="code" href="classpopot_1_1rng_1_1MersenneRNG.html#a686f65e78d16508866446199fda3212d">nb_calls</a>;
<a name="l00078"></a>00078 
<a name="l00079"></a><a class="code" href="classpopot_1_1rng_1_1MersenneRNG.html#a9c0eebf6f74107b813248cc112bfebd7">00079</a>       <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="classpopot_1_1rng_1_1MersenneRNG.html#a9c0eebf6f74107b813248cc112bfebd7">rng_srand</a>()
<a name="l00080"></a>00080       {
<a name="l00081"></a>00081         <a class="code" href="classpopot_1_1rng_1_1MersenneRNG.html#a9c0eebf6f74107b813248cc112bfebd7">rng_srand</a>(time(NULL));
<a name="l00082"></a>00082       }
<a name="l00083"></a>00083 
<a name="l00084"></a>00084       <span class="comment">/* initializes mt[NN] with a seed */</span>
<a name="l00085"></a><a class="code" href="classpopot_1_1rng_1_1MersenneRNG.html#aaee63d54e6dc53adaf8385d9bf6927b4">00085</a>       <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="classpopot_1_1rng_1_1MersenneRNG.html#a9c0eebf6f74107b813248cc112bfebd7">rng_srand</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> <span class="keywordtype">long</span> seed)
<a name="l00086"></a>00086       {
<a name="l00087"></a>00087         mt[0] = seed;
<a name="l00088"></a>00088         <span class="keywordflow">for</span> (mti=1; mti&lt;<a class="code" href="mersenne_8h.html#a170755e30c36be4904106b7bb279b1ec">NN</a>; mti++) 
<a name="l00089"></a>00089           mt[mti] =  (6364136223846793005ULL * (mt[mti-1] ^ (mt[mti-1] &gt;&gt; 62)) + mti);
<a name="l00090"></a>00090       }
<a name="l00091"></a>00091 
<a name="l00092"></a><a class="code" href="classpopot_1_1rng_1_1MersenneRNG.html#a980c631aa41a22ed0087a46dc69392b0">00092</a>       <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="classpopot_1_1rng_1_1MersenneRNG.html#a980c631aa41a22ed0087a46dc69392b0">rng_warm_up</a>(<span class="keywordtype">void</span>)
<a name="l00093"></a>00093       {
<a name="l00094"></a>00094         <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0 ; i &lt; 10000 ; ++i)
<a name="l00095"></a>00095           <a class="code" href="classpopot_1_1rng_1_1MersenneRNG.html#a8823785665d0cb679e485baa9bba43e4">rng_rand</a>();
<a name="l00096"></a>00096       }
<a name="l00097"></a>00097 
<a name="l00098"></a>00098       <span class="comment">/* initialize by an array with array-length */</span>
<a name="l00099"></a>00099       <span class="comment">/* init_key is the array for initializing keys */</span>
<a name="l00100"></a>00100       <span class="comment">/* key_length is its length */</span>
<a name="l00101"></a>00101       <span class="comment">/*</span>
<a name="l00102"></a>00102 <span class="comment">        void init_by_array64(unsigned long long init_key[],</span>
<a name="l00103"></a>00103 <span class="comment">        unsigned long long key_length)</span>
<a name="l00104"></a>00104 <span class="comment">        {</span>
<a name="l00105"></a>00105 <span class="comment">        unsigned long long i, j, k;</span>
<a name="l00106"></a>00106 <span class="comment">        init_genrand64(19650218ULL);</span>
<a name="l00107"></a>00107 <span class="comment">        i=1; j=0;</span>
<a name="l00108"></a>00108 <span class="comment">        k = (NN&gt;key_length ? NN : key_length);</span>
<a name="l00109"></a>00109 <span class="comment">        for (; k; k--) {</span>
<a name="l00110"></a>00110 <span class="comment">        mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] &gt;&gt; 62)) * 3935559000370003845ULL))</span>
<a name="l00111"></a>00111 <span class="comment">        + init_key[j] + j; // non linear </span>
<a name="l00112"></a>00112 <span class="comment">        i++; j++;</span>
<a name="l00113"></a>00113 <span class="comment">        if (i&gt;=NN) { mt[0] = mt[NN-1]; i=1; }</span>
<a name="l00114"></a>00114 <span class="comment">        if (j&gt;=key_length) j=0;</span>
<a name="l00115"></a>00115 <span class="comment">        }</span>
<a name="l00116"></a>00116 <span class="comment">        for (k=NN-1; k; k--) {</span>
<a name="l00117"></a>00117 <span class="comment">        mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] &gt;&gt; 62)) * 2862933555777941757ULL))</span>
<a name="l00118"></a>00118 <span class="comment">        - i; // non linear </span>
<a name="l00119"></a>00119 <span class="comment">        i++;</span>
<a name="l00120"></a>00120 <span class="comment">        if (i&gt;=NN) { mt[0] = mt[NN-1]; i=1; }</span>
<a name="l00121"></a>00121 <span class="comment">        }</span>
<a name="l00122"></a>00122 <span class="comment"></span>
<a name="l00123"></a>00123 <span class="comment">        mt[0] = 1ULL &lt;&lt; 63; // MSB is 1; assuring non-zero initial array </span>
<a name="l00124"></a>00124 <span class="comment">        }</span>
<a name="l00125"></a>00125 <span class="comment">      */</span>
<a name="l00126"></a>00126 
<a name="l00127"></a>00127       <span class="comment">/* generates a random number on [0, 2^64-1]-interval */</span>
<a name="l00128"></a><a class="code" href="classpopot_1_1rng_1_1MersenneRNG.html#af0e32f17c9639fddd54bd41651d09c1f">00128</a>       <span class="keyword">static</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> <span class="keywordtype">long</span> <a class="code" href="classpopot_1_1rng_1_1MersenneRNG.html#af0e32f17c9639fddd54bd41651d09c1f">genrand64_int64</a>(<span class="keywordtype">void</span>)
<a name="l00129"></a>00129       {
<a name="l00130"></a>00130         <span class="keywordtype">int</span> i;
<a name="l00131"></a>00131         <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> <span class="keywordtype">long</span> x;
<a name="l00132"></a>00132         <span class="keyword">static</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> <span class="keywordtype">long</span> mag01[2]={0ULL, <a class="code" href="mersenne_8h.html#a376c3581bae3c2367fc9ce694e5a8949">MATRIX_A</a>};
<a name="l00133"></a>00133 
<a name="l00134"></a>00134         <span class="keywordflow">if</span> (mti &gt;= <a class="code" href="mersenne_8h.html#a170755e30c36be4904106b7bb279b1ec">NN</a>) { <span class="comment">/* generate NN words at one time */</span>
<a name="l00135"></a>00135 
<a name="l00136"></a>00136           <span class="comment">/* if init_genrand64() has not been called, */</span>
<a name="l00137"></a>00137           <span class="comment">/* a default initial seed is used     */</span>
<a name="l00138"></a>00138           <span class="keywordflow">if</span> (mti == <a class="code" href="mersenne_8h.html#a170755e30c36be4904106b7bb279b1ec">NN</a>+1) 
<a name="l00139"></a>00139             <a class="code" href="classpopot_1_1rng_1_1MersenneRNG.html#a9c0eebf6f74107b813248cc112bfebd7">rng_srand</a>(5489ULL); 
<a name="l00140"></a>00140 
<a name="l00141"></a>00141           <span class="keywordflow">for</span> (i=0;i&lt;<a class="code" href="mersenne_8h.html#a170755e30c36be4904106b7bb279b1ec">NN</a>-<a class="code" href="mersenne_8h.html#afdc383f8992f4a960bb22998f57b6d37">MM</a>;i++) {
<a name="l00142"></a>00142             x = (mt[i]&amp;<a class="code" href="mersenne_8h.html#a4b9cfb88c6beb4254e2971abacbd8aab">UM</a>)|(mt[i+1]&amp;<a class="code" href="mersenne_8h.html#a4b3e3200940ab78533ae2126430fe840">LM</a>);
<a name="l00143"></a>00143             mt[i] = mt[i+<a class="code" href="mersenne_8h.html#afdc383f8992f4a960bb22998f57b6d37">MM</a>] ^ (x&gt;&gt;1) ^ mag01[(<span class="keywordtype">int</span>)(x&amp;1ULL)];
<a name="l00144"></a>00144           }
<a name="l00145"></a>00145           <span class="keywordflow">for</span> (;i&lt;<a class="code" href="mersenne_8h.html#a170755e30c36be4904106b7bb279b1ec">NN</a>-1;i++) {
<a name="l00146"></a>00146             x = (mt[i]&amp;<a class="code" href="mersenne_8h.html#a4b9cfb88c6beb4254e2971abacbd8aab">UM</a>)|(mt[i+1]&amp;<a class="code" href="mersenne_8h.html#a4b3e3200940ab78533ae2126430fe840">LM</a>);
<a name="l00147"></a>00147             mt[i] = mt[i+(MM-<a class="code" href="mersenne_8h.html#a170755e30c36be4904106b7bb279b1ec">NN</a>)] ^ (x&gt;&gt;1) ^ mag01[(int)(x&amp;1ULL)];
<a name="l00148"></a>00148           }
<a name="l00149"></a>00149           x = (mt[NN-1]&amp;<a class="code" href="mersenne_8h.html#a4b9cfb88c6beb4254e2971abacbd8aab">UM</a>)|(mt[0]&amp;<a class="code" href="mersenne_8h.html#a4b3e3200940ab78533ae2126430fe840">LM</a>);
<a name="l00150"></a>00150           mt[NN-1] = mt[MM-1] ^ (x&gt;&gt;1) ^ mag01[(<span class="keywordtype">int</span>)(x&amp;1ULL)];
<a name="l00151"></a>00151 
<a name="l00152"></a>00152           mti = 0;
<a name="l00153"></a>00153         }
<a name="l00154"></a>00154   
<a name="l00155"></a>00155         x = mt[mti++];
<a name="l00156"></a>00156 
<a name="l00157"></a>00157         x ^= (x &gt;&gt; 29) &amp; 0x5555555555555555ULL;
<a name="l00158"></a>00158         x ^= (x &lt;&lt; 17) &amp; 0x71D67FFFEDA60000ULL;
<a name="l00159"></a>00159         x ^= (x &lt;&lt; 37) &amp; 0xFFF7EEE000000000ULL;
<a name="l00160"></a>00160         x ^= (x &gt;&gt; 43);
<a name="l00161"></a>00161 
<a name="l00162"></a>00162         <span class="keywordflow">return</span> x;
<a name="l00163"></a>00163       }
<a name="l00164"></a>00164 
<a name="l00165"></a>00165       <span class="comment">/* generates a random number on [0, 2^63-1]-interval */</span>
<a name="l00166"></a>00166       <span class="comment">/*</span>
<a name="l00167"></a>00167 <span class="comment">      long long genrand64_int63(void)</span>
<a name="l00168"></a>00168 <span class="comment">      {</span>
<a name="l00169"></a>00169 <span class="comment">        return (long long)(genrand64_int64() &gt;&gt; 1);</span>
<a name="l00170"></a>00170 <span class="comment">      }</span>
<a name="l00171"></a>00171 <span class="comment">      */</span>
<a name="l00172"></a>00172 
<a name="l00173"></a>00173       <span class="comment">/* generates a random number on [0,1]-real-interval */</span>
<a name="l00174"></a>00174       <span class="comment">/*</span>
<a name="l00175"></a>00175 <span class="comment">      double genrand64_real1(void)</span>
<a name="l00176"></a>00176 <span class="comment">      {</span>
<a name="l00177"></a>00177 <span class="comment">        return (genrand64_int64() &gt;&gt; 11) * (1.0/9007199254740991.0);</span>
<a name="l00178"></a>00178 <span class="comment">      }</span>
<a name="l00179"></a>00179 <span class="comment">      */</span>
<a name="l00180"></a>00180 
<a name="l00181"></a>00181       <span class="comment">/* generates a random number on [0,1)-real-interval */</span>
<a name="l00182"></a><a class="code" href="classpopot_1_1rng_1_1MersenneRNG.html#a8823785665d0cb679e485baa9bba43e4">00182</a>       <span class="keyword">static</span> <span class="keywordtype">double</span> <a class="code" href="classpopot_1_1rng_1_1MersenneRNG.html#a8823785665d0cb679e485baa9bba43e4">rng_rand</a>(<span class="keywordtype">void</span>)
<a name="l00183"></a>00183       {
<a name="l00184"></a>00184         <span class="keywordflow">return</span> (<a class="code" href="classpopot_1_1rng_1_1MersenneRNG.html#af0e32f17c9639fddd54bd41651d09c1f">genrand64_int64</a>() &gt;&gt; 11) * (1.0/9007199254740992.0);
<a name="l00185"></a>00185       }
<a name="l00186"></a>00186 
<a name="l00187"></a>00187       <span class="comment">/* generates a random number on (0,1)-real-interval */</span>
<a name="l00188"></a>00188       <span class="comment">/*</span>
<a name="l00189"></a>00189 <span class="comment">      double genrand64_real3(void)</span>
<a name="l00190"></a>00190 <span class="comment">      {</span>
<a name="l00191"></a>00191 <span class="comment">        return ((genrand64_int64() &gt;&gt; 12) + 0.5) * (1.0/4503599627370496.0);</span>
<a name="l00192"></a>00192 <span class="comment">      }</span>
<a name="l00193"></a>00193 <span class="comment">      */</span>
<a name="l00194"></a>00194 
<a name="l00195"></a>00195 
<a name="l00196"></a>00196     };
<a name="l00197"></a>00197 
<a name="l00198"></a>00198     <span class="keywordtype">int</span> MersenneRNG::mti = 0;<span class="comment">//MersenneRNG::NN+1;</span>
<a name="l00199"></a>00199     <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> <span class="keywordtype">long</span> MersenneRNG::mt[<a class="code" href="mersenne_8h.html#a170755e30c36be4904106b7bb279b1ec">NN</a>];
<a name="l00200"></a>00200     <span class="keywordtype">int</span> MersenneRNG::nb_calls;
<a name="l00201"></a>00201   }
<a name="l00202"></a>00202 }
<a name="l00203"></a>00203 
<a name="l00204"></a>00204 
<a name="l00205"></a>00205 
<a name="l00206"></a>00206 
<a name="l00207"></a>00207 
<a name="l00208"></a>00208 
<a name="l00209"></a>00209 
<a name="l00210"></a>00210 <span class="preprocessor">#endif</span>
</pre></div></div>
</div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Namespaces</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark">&#160;</span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark">&#160;</span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark">&#160;</span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark">&#160;</span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(9)"><span class="SelectionMark">&#160;</span>Friends</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(10)"><span class="SelectionMark">&#160;</span>Defines</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>



<hr class="footer"/><address class="footer"><small>
Generated by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.7.5
</small></address>

</body>
</html>
